A Beck - Fiala-type Theorem for Euclidean Norms
نویسنده
چکیده
The inequality in (a) is naturally the best possible. Theorem l(a) is connected with questions such as the Beck-Fiala theorem or the Koml6s conjecture (see [2J, [3J and [7]). Combinatorial motivations are presented exhaustively in [8J (see also [6]). In a slightly different form, Theorem l(a) was used in [IJ in the proof that nuclear Frechet spaces satisfy the Levy-Steinitz theorem on rearrangement of series (or, more precisely, that a nuclear operator acting between Hilbert spaces is a Steinitz operator). If D is the euclidean unit ball in [Rn, the right-hand side in (a) is equal to Vii; this special case was obtained by S. Sevastyanov [5J and, independently, by I. Barany (unpublished). Theorem l(b) is connected with the so-called Steinitz lemma (see [4], especially Theorem 2). It confirms the hy,Pothesis that the Steinitz constant of the n-dimensional euclidean space is of order Vn as n-H~) (or, more generally, that Hilbert-Schmidt operators are Steinitz operators); see [1, Remarks 8 and 7). Another consequence of Theorem l(b) is Theorem 2, given at the end of the paper. The author is indebted to I. Barany and S. Sevastyanov for their comments on the subject.
منابع مشابه
An Improvement of the Beck-Fiala Theorem
In 1981 Beck and Fiala proved an upper bound for the discrepancy of a set system of degree d that is independent of the size of the ground set. In the intervening years the bound has been decreased from 2d− 2 to 2d− 4. We improve the bound to 2d− log∗ d. MSC classes: 05D05, 11K38, 05C15
متن کاملApproximation of Multi { Color
In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to c colors. We give a recursive method that constructs c{colorings from approximations to the 2{color discrepancy. This method works for a large class of theorems like the six{standard{deviation theorem of Spencer, the Beck{Fiala theorem and the results of ...
متن کاملApproximation of Multi-color Discrepancy
In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to c colors. We give a recursive method that constructs c{colorings from approximations to the 2{color discrepancy. This method works for a large class of theorems like the six{standard{deviation theorem of Spencer, the Beck{Fiala theorem and the results of ...
متن کاملMulti–color Discrepancies
In this article we introduce combinatorial multi-color discrepancies and generalize several classical results from 2–color discrepancy theory to c colors (c ≥ 2). We give a recursive method that constructs c–colorings from approximations of 2–color discrepancies. This method works for a large class of theorems like the ‘six standard deviations’ theorem of Spencer, the Beck–Fiala theorem, the re...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 11 شماره
صفحات -
تاریخ انتشار 1990